A Note on Multiflow Locking Theorem
نویسنده
چکیده
This note addresses the undirected multiflow (multicommodity flow) theory. A multiflow in a network with terminal set T can be regarded as a single commodity (A, T \A)-flow for any nonempty proper subset A ⊂ T by ignoring flows not connecting A and T \ A. A set system A on T is said to be lockable if for every network having T as terminal set there exists a multiflow being simultaneously a maximum (A, T \A)-flow for every A ∈ A. The multiflow locking theorem, due to Karzanov and Lomonosov, says that A is lockable if and only if it is 3-cross-free. A multiflow can also be regarded as a single commodity (A,B)-flow for every partial cut (A,B) of terminals, where a partial cut is a pair of disjoint subsets (not necessarily a bipartition). Based on this observation, we study the locking property for partial cuts, and prove an analogous characterization for a lockable family of partial cuts.
منابع مشابه
On Integer Multiflow Maximization
Generalizing the two-commodity ow theorem of Rothschild and Whinston and the multiiow theorem of Lovv asz and Cherkasskij, Karzanov and Lomonosov proved a min-max theorem on maximum multiiows in the seventies. Their original proof is quite long and technical and relies on earlier investigations on metrics. The main purpose of the present paper is to provide a relatively simple proof of this the...
متن کاملOn duality and fractionality of multicommodity flows in directed networks
In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminalweightμ, we define ametrized polyhedral complex, called the directed tight span Tμ, and prove that the dual of the μ-weighted maximum multiflow problem reduces to a facility location problem on Tμ. Also, in case where the network is Eulerian, it further reduces to a ...
متن کاملCs 598csc: Combinatorial Optimization 1 Okamura-seymour Theorem
Theorem 1 Let G = (V, E) be a plane graph and let H = (T, R) be a demand graph where T is the set of vertices of a single face of G. Then if G satisfies the cut condition for H and G + H is eulerian, there is an integral multiflow for H in G. The proof is via induction on 2|E| − |R|. Note that if G satisfies the cut condition for H, then |R| ≤ |E| (why?). There are several " standard " inductio...
متن کاملFolder complexes and multiflow combinatorial dualities By Hiroshi
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کاملFolder Complexes and Multiflow Combinatorial Dualities
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کامل